On the Locating Rainbow Connection Number of Trees and Regular Bipartite Graphs
نویسندگان
چکیده
Locating the rainbow connection number of graphs is a new mathematical concept that combines concepts vertex coloring and partition dimension. In this research, we determine lower upper bounds locating graph provide characterization with equal to its restrict graph. We also found trees regular bipartite graphs. The method used in study deductive begins literature related relevant previous research results, making hypotheses, conducting proofs, drawing conclusions. This concludes only path orders 2, 3, 4, complete have 2 order G, respectively. showed range r-⌊n/4⌋+2 n/2+1, tree determined based on maximum pendants or internal vertices. Doi: 10.28991/ESJ-2023-07-04-016 Full Text: PDF
منابع مشابه
Rainbow Connection of Random Regular Graphs
An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this work we study the rainbow connection of the random r-regular graph G = G(n, r) of order n, where r ≥ 4 is a c...
متن کاملA Note on the Rainbow Connection of Random Regular Graphs
We prove that a random 3-regular graph has rainbow connection number O(log n). This completes the remaining open case from Rainbow connection of random regular graphs, by Dudek, Frieze and Tsourakakis.
متن کاملRainbow connection number of dense graphs
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we show that rc(G) ≤ 3 if |E(G)| ≥ ( n−2 2 ) + 2, and rc(G) ≤ 4 if |E(G)| ≥ ( n−3 2 ) + 3. These bounds...
متن کاملGraphs with rainbow connection number two
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. In this paper we prove that rc(G) = 2 for every connected graph G of order n and size m, where (
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Emerging science journal
سال: 2023
ISSN: ['2610-9182']
DOI: https://doi.org/10.28991/esj-2023-07-04-016